New Place and Route Algorithms for Wire Length Improvement With Concern to Critical Paths

نویسندگان

  • Renato Hentschke
  • Marcelo Johann
  • Ricardo Reis
چکیده

3D Circuits are one of the most promising technologies for reducing wire lengths [1] and improving circuit power [2] and timing [3] for future high performance designs. On a 3D VLSI Circuit, tiers of active area are stacked, providing higher integration density, shrinking the distances between the cells and reducing wire lengths as a consequence. In order to take full benefit of the technology, new algorithms on the CAD field must be provided to handle 3D arrangement of circuit elements while considering new issues caused by the 3D integration. Today, the research in this field is still on the early years. Consider the 3D placement problem, for instance. The richness and variety of techniques that led to significant advances on 2D circuit placement over the decades will be able to deliver similar maturity to the 3D placement field. This thesis targets the wire length improvement of VLSI circuit considering critical elements of a circuit. It considers the problem from two different perspectives: placement and routing. On placement, it explores methods to perform placement of 3D circuits considering issues related to vertical interconnects (3D-Vias). A very significant volume of new methods and contributions are presented in the text and fully validated in a tool called Z-Place (section II). On routing, a new flexible algorithm called AMAZE is proposed (section III), combining existing and new methods that are very effective to produce short wire length and low delay to critical elements.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An Algorithm to Obtain Possibly Critical Paths in Imprecise Project Networks

  We consider criticality in project networks having imprecise activity duration times. It is well known that finding all possibly critical paths of an imprecise project network is an NP-hard problem. Here, based on a method for finding critical paths of crisp networks by using only the forward recursion of critical path method, for the first time an algorithm is proposed which can find all pos...

متن کامل

Snakes and Caterpillars in Graceful Graphs

Graceful labelings use a prominent place among difference vertex labelings. In this work we present new families of graceful graphs all of them obtained applying a general substitution result. This substitution is applied here to replace some paths with some trees with a more complex structures. Two caterpillars with the same size are said to be textit{analogous} if thelarger stable sets, in bo...

متن کامل

Investigating the effect of structural form of outdoor path of residential complexes on improving the routing of people in emergency situations

Background and Objective: Due to the importance of time in choosing the optimal routing to reduce the damage caused by accidents in critical situations such as earthquakes, fires, etc., the structural form of the route has a significant impact on the selection of people in emergencies. It can also be very effective in the work for designers, managers and urban planners for disaster risk managem...

متن کامل

An Improved Standard Cell Placement Methodology using Hybrid Analytic and Heuristic Techniques

In recent years, size of VLSI circuits is dramatically grown and layout generation of current circuits has become a dominant task in design flow. Standard cell placement is an effective stage of physical design and quality of placement affects directly on the performance, power consumption and signal immunity of design. Placement can be performed analytically or heuristically. Analytical placer...

متن کامل

An Efficient Method for Selecting a Reliable Path under Uncertainty Conditions

In a network that has the potential to block some paths, choosing a reliable path, so that its survival probability is high, is an important and practical issue. The importance of this issue is very considerable in critical situations such as natural disasters, floods and earthquakes. In the case of the reliable path, survival or blocking of each arc on a network in critical situations is an un...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2007